Duality in nondifferentiable minimax fractional programming with B-(p, r)- invexity
نویسندگان
چکیده
منابع مشابه
Duality in nondifferentiable minimax fractional programming with B-(p, r)-invexity
* Correspondence: drizhar@kfupm. edu.sa Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia Full list of author information is available at the end of the article Abstract In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution t...
متن کاملDuality in nondifferentiable minimax fractional programming with generalized convexity
A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.
متن کاملGeneralized Minimax Programming with Nondifferentiable (G, β)-Invexity
We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz (G, β)-invex. Not only G-sufficient but also G-necessary optimality conditions are established for problem (P). With G-necessary optimality conditions and (G, β)-invexity on hand, we construct dual problem (DI) for the primal one (P) and prove duality results between problems (P) and (DI). These...
متن کاملSufficiency and Duality in Minimax Fractional Programming with Generalized (φ, Ρ)-invexity
Amongst various important applications, one important application of nonlinear programming is to maximize or minimize the ratio of two functions, commonly called fractional programming. The characteristics of fractional programming problems have been investigated widely [1, 6, 10] and [13]. In noneconomic situations, fractional programming problems arisen in information theory, stochastic progr...
متن کاملOptimality Conditions and Duality in Nondifferentiable Minimax Fractional Programming with Generalized Convexity1
We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2011
ISSN: 1029-242X
DOI: 10.1186/1029-242x-2011-75